Lineality Removal for Copositive{plus Normal Maps

نویسنده

  • Menglin Cao
چکیده

We are concerned with solving aane variational inequalities deened by a linear map A and a polyhedral set C. Most of the existing pivotal methods for such inequalities or mixed linear complementarity problems depend on the existence of extreme points in C or a certain non{singularity property of A with respect to the lineality of C. In this paper, we prove that if A is copositive{plus with respect to the recession cone of C, then the lineality space can be removed without any further assumptions. The reductions given here extend the currently known pivotal methods to solve aane variational inequalities or prove that no solution exists, whenever A is copositive{plus withe respect to the recession cone of C.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Linear Complementarityproblemsm

It has been shown by Lemke that if a matrix is copositive plus on IR n , then feasibility of the corresponding Linear Complementarity Problem implies solvability. In this article we show, under suitable conditions, that feasibility of a Generalized Linear Complementarity Problem (i.e., deened over a more general closed convex cone in a real Hilbert Space) implies solvability whenever the operat...

متن کامل

On the Structure of Positive Maps between Matrix Algebras

We will be concerned with linear positive maps φ : Mm(C) → Mn(C). To fix notation we begin with setting up the notation and the relevant terminology (cf. [7]). We say that φ is positive if φ(A) is a positive element in Mn(C) for every positive matrix from Mm(C). If k ∈ N, then φ is said to be k-positive (respectively k-copositive) whenever [φ(Aij)] k i,j=1 (respectively [φ(Aji)] k i,j=1) is pos...

متن کامل

Finding the Number of Members with Certain Relationships in Social Networks and Big Size Organizations using Copositive Programming

In social networks and big size organizations, finding the number of members that all of them have a certain relationship w* is an important problem for managers, as well the number of members that none of them has not the relationship (w*). Considering the members as vertices and the relationship as edges, w* and  w* denote the clique number and the number of edges in the independent graph, re...

متن کامل

Scaffolding EFL Oral Performance through Story Maps and Podcasts and Students’ Attitudes toward it

The present study sought to explore the impact of story maps and audio podcasts as scaffolds on oral proficiency of Iranian EFL learners. The quasi-experimental study was launched with 36 EFL undergraduates in three groups by adopting a counterbalanced 3  3 Latin squared design. All participants were indiscriminately, but in a specified order, exposed to the three treatment conditions of story ...

متن کامل

Ela Constructing Copositive Matrices from Interior Matrices

Abstract. Let A be an n by n symmetric matrix with real entries. Using the l1-norm for vectors and letting S 1 = {x ∈ R|||x||1 = 1, x ≥ 0}, the matrix A is said to be interior if the quadratic form x Ax achieves its minimum on S 1 in the interior. Necessary and sufficient conditions are provided for a matrix to be interior. A copositive matrix is referred to as being exceptional if it is not th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995